minimization problem造句
例句與造句
- Continuation method for non - linear l1 norm minimization problem
1模極小化問題的路徑跟蹤算法 - Constrained minimization problem
約束最小化問題 - This paper presents a solution to the test time minimization problem for core - based systems
本文針對(duì)基于芯核系統(tǒng)的測(cè)試時(shí)間最小化問題提出了一種解決方案。 - With merit function , the origin problem can be conformed to unconstrained or constrained minimization problems
利用merit函數(shù)的極小化變形可分為無約束和約束兩種類型。 - It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function
我們知道，通過廣義d -間隙函數(shù)，可以將變分不等式問題轉(zhuǎn)化為一個(gè)無約束極小化問題。 - It's difficult to find minimization problem in a sentence. 用minimization problem造句挺難的
- When the systems is normal , the stability condition of the observer system is approximated with a minimization problem involving conditions of linear matrix inequalities
假定其可能發(fā)生故障，設(shè)計(jì)了離散狀態(tài)觀測(cè)器，對(duì)其進(jìn)行故障檢測(cè)。 - Finally , prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem
最后，還證明了得到的凹規(guī)劃和反凸規(guī)劃的全局最優(yōu)解就是原問題的近似全局最優(yōu)解。 - Similarly , the minimization problem is also transformed into a multiobjective problem by using the other order relations , so by doing the multiobjective problem a solution of the primitive problem can be obtained
而對(duì)最小化問題，也可定義區(qū)間數(shù)之間的另一序關(guān)系，同樣可把原問題轉(zhuǎn)化為一個(gè)多目標(biāo)問題，通過求此多目標(biāo)問題得到原問題的解。 - In this chapter , we consider the method of constrained equivalent formulation . we use the merit function based on the restrained ncp function and convert the origin problem ncp ( f ) to minimization problem which constrained on rn +
我們?cè)谶@一章里就考慮了ncp ( f )的約束極小化變形，通過限制的ncp函數(shù)來構(gòu)造ncp問題的merit函數(shù)，將原始的問題ncp ( f )轉(zhuǎn)化為( - In this paper , we consider identifications of physical parameters in the following parabolic initial - boundary value problems . the identification problem is formulated as a constrained minimization problem by using the output least squares approach with the h1 - regularization
作為一個(gè)最優(yōu)控制問題，我們視溫度分布v為輸出，參數(shù)q ( x )為控制，考慮了一類最優(yōu)控制問題的逆問題。 - The algorithm only needs to solve an ill - posed linear system and a well - posed minimization problem and requires only the knowledge of the near field measurements of the scattered fields due to point source fields at a finite number of incidence and observation points distributed over a limited aperture
該算法只需求解一個(gè)不適定的線性系和一個(gè)適定的非線性最小化問題，而且只需要點(diǎn)源入射場(chǎng)的散射場(chǎng)在某個(gè)有限孔徑中若干有限個(gè)入射和測(cè)量點(diǎn)上的近場(chǎng)測(cè)量信息。 - Chapter 4 studies the techniques for numerical realization of the dual algorithms and generalization of the dual algorithms to general unconstrained nonlinear programming . at first , we construct modified dual algorithms to overcome the drawback that it needs to resolve a sequential unconstrained minimization problems exactly in the step 2 of the dual algorithms in chapter 2 and chapter 3
首先針對(duì)前兩章的對(duì)偶算法由于需要精確求解一系列無約束極小化問題，因而實(shí)際計(jì)算中很難實(shí)現(xiàn)這一缺點(diǎn)，構(gòu)造修正的對(duì)偶算法，即，關(guān)于勢(shì)函數(shù)的無約束極小化問題無需精確求解的對(duì)偶算法。 - By intro - ducing a penalty function as the following , for every e > 0 , we construct a sequence of unconstrained minimization problems to approximate the constrained minimization problem . the solutions of such a sequence of unconstrained minimization problems all exist , and they converge to the solution of the constrained minimization problem in a certain sense
這列無約束極小化問題( p _ )的解都是存在的，并且在某種意義下收斂至原始約束極小化問題( p )的解，不僅如此，它們的性能指標(biāo)也收斂至原始問題( p )解的性能指標(biāo)。